public class MyCircularQueue {
    public int elem[];
    public int front;
    public int rear;
    public MyCircularQueue(int k) {
        elem = new int[k+1];
    }

    /**
     * 入队列
     * @param value
     * @return
     */
    public boolean enQueue(int value) {
        if(isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear+1)%elem.length;
        return true;
    }
    /**
     * 出队列
     * @return
     */
    public boolean deQueue() {
        if (isEmpty()){
            return false;
        }
        front = (front+1)%elem.length;
        return true;
    }
    /**
     * 得到队头元素
     * @return
     */
    public int Front() {
        if (isEmpty()){
            return -1;
        }
        return elem[front];
    }

    /**
     * 得到队尾元素
     * @return
     */
    public int Rear() {
        if (isEmpty()){
            return -1;
        }
        int index = (rear == 0)? elem.length-1: rear-1;
        return elem[index];
    }

    public boolean isEmpty() {
        return front == rear;
    }

    /**
     * 判断循环队列是否为满
     * @return
     */
    public boolean isFull() {
        return (rear+1)%elem.length  == front;
    }
}
